package com.xxwy.lintcode;

/**
 * @author xxwy
 * on 2018/10/10 0010
 * Longest Continuous Increasing Subsequence
 * 最长上升连续子序列
 */
public class Num397 {
    /**
     * @param A: An array of Integer
     * @return: an integer
     */
    public int longestIncreasingContinuousSubsequence(int[] A) {
        // write your code here
        return 0;
    }
}
